An Algorithm for Free Algebras
نویسنده
چکیده
We present an algorithm for constructing the free algebra over a given finite partial algebra in the variety determined by a finite list of equations. The algorithm succeeds whenever the desired free algebra
منابع مشابه
Characterization of $delta$-double derivations on rings and algebras
The main purpose of this article is to offer some characterizations of $delta$-double derivations on rings and algebras. To reach this goal, we prove the following theorem:Let $n > 1$ be an integer and let $mathcal{R}$ be an $n!$-torsion free ring with the identity element $1$. Suppose that there exist two additive mappings $d,delta:Rto R$ such that $$d(x^n) =Sigma^n_{j=1} x^{n-j}d(x)x^{j-1}+Si...
متن کاملALGEBRAS WITH CYCLE-FINITE STRONGLY SIMPLY CONNECTED GALOIS COVERINGS
Let $A$ be a nite dimensional $k-$algebra and $R$ be a locally bounded category such that $R rightarrow R/G = A$ is a Galois covering dened by the action of a torsion-free group of automorphisms of $R$. Following [30], we provide criteria on the convex subcategories of a strongly simply connected category R in order to be a cycle- nite category and describe the module category of $A$. We p...
متن کاملCharacterization of $(delta, varepsilon)$-double derivation on rings and algebras
This paper is an attempt to prove the following result:Let $n>1$ be an integer and let $mathcal{R}$ be a $n!$-torsion-free ring with the identity element. Suppose that $d, delta, varepsilon$ are additive mappings satisfyingbegin{equation}d(x^n) = sum^{n}_{j=1}x^{n-j}d(x)x^{j-1}+sum^{n-1}_{j=1}sum^{j}_{i=1}x^{n-1-j}Big(delta(x)x^{j-i}varepsilon(x)+varepsilon(x)x^{j-i}delta(x)Big)x^{i-1}quadend{e...
متن کاملOn categories of merotopic, nearness, and filter algebras
We study algebraic properties of categories of Merotopic, Nearness, and Filter Algebras. We show that the category of filter torsion free abelian groups is an epireflective subcategory of the category of filter abelian groups. The forgetful functor from the category of filter rings to filter monoids is essentially algebraic and the forgetful functor from the category of filter groups to the cat...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011